Possible Automata
نویسنده
چکیده
This paper is concerned with the widest class of automaton structures whose semantics is compatible with our notions of state and automaton. It is first shown that the conventional spectrum of deterministic, stochastic, fuzzy and non-deterministic can be fitted into a single framework which is complete. In particular new results on the normalization of fuzzy automata and the relationship between fuzzy and stochastic automata are derived. A practical counter-example is then developed that does not fit into this spectrum, showing it to be inadequate. This is based on the richer interpretation of the notion of possibility that is required in the analysis of system stability and reliability. Finally, basic arguments are advanced to show that the structure must be at least an ordered semiri~ and at most a commutative ordered semiring.
منابع مشابه
Robot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملرمزنگاری تصاویر با استفاده از اتوماتای سلولی برگشت پذیر
In this paper, a new structure for image encryption using recursive cellular automatais presented. The image encryption contains three recursive cellular automata in three steps, individually. At the first step, the image is blocked and the pixels are substituted. In the next step, pixels are scrambledby the second cellular automata and at the last step, the blocks are attachedtogether and the ...
متن کاملNovel efficient fault-tolerant full-adder for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for semiconductor transistor based technologies. A novel fault-tolerant QCA full-adder cell is proposed: This component is simple in structure and suitable for designing fault-tolerant QCA circuits. The redundant version of QCA full-adder cell is powerful in terms of implementing robust digital functions. ...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملNovel Phase-frequency Detector based on Quantum-dot Cellular Automata Nanotechnology
The electronic industry has grown vastly in recent years, and researchers are trying to minimize circuits delay, occupied area and power consumption as much as possible. In this regard, many technologies have been introduced. Quantum Cellular Automata (QCA) is one of the schemes to design nano-scale digital electronic circuits. This technology has high speed and low power consumption, and occup...
متن کاملارائه روشی برای رمزنگاری تصاویر با استفاده از اتوماتای سلولی ترکیبی
In this paper, a new structure for image encryption using hybrid cellular automata is presented. The image encryption is done in two steps. At the first step, each pixel is encrypted by rules of hybrid cellular automata. In the next step, each pixel converted to a binary number and each bit is encrypted by rules of cellular automata. The rules are made by a function. Due to reversibility of cel...
متن کامل